Enumeration, Construction and Random Generation of Block Codes
نویسنده
چکیده
We discuss some methods for the enumeration, construction and random generation of isometry classes of block codes using methods from algebraic combinatorics.
منابع مشابه
Block coset codes for M-ary phase shift keying
Aktract-Construction of efficient block-encoded M-ary phase shift keying (M-PSK) schemes is investigated in this paper. An algebraic approach is adopted in which the basic modulation signals are associated with the elements of a finite group. Using some of the properties of group partition chains, the algebraic properties of linear codes are investigated. From this analysis, a class of codes ca...
متن کاملBinary Linear Codes with Optimal Scaling and Quasi-Linear Complexity
We present the first family of binary codes that attains optimal scaling and quasi-linear complexity, at least for the binary erasure channel (BEC). In other words, for any fixed δ > 0, we provide codes that ensure reliable communication at rates within ε > 0 of the Shannon capacity with block length n = O(1/ε2+δ), construction complexity Θ(n), and encoding/decoding complexity Θ(n log n). Furth...
متن کاملA New Construction for Low Density Parity Check Convolutional Codes
Low density parity check (LDPC) block codes have been shown to achieve near capacity performance for binary transmission over noisy channels. Block codes, however, require splitting the data to be transmitted into frames, which can be a disadvantage in some applications. Convolutional codes, on the other hand, have no such requirement, and are hence well suited for continuous transmission. In [...
متن کاملPolarization of Multi-Relay Channels: A Suitable Method for DF and CF Relaying with Orthogonal Receiver
Polar codes, that have been recently introduced by Arikan, are one of the first codes that achieved the capacity for vast numerous channels and they also have low complexity in symmetric memoryless channels. Polar codes are constructed based on a phenomenon called channel polarization. This paper discusses relay channel polarization in order to achieve the capacity and show that if inputs of tw...
متن کاملA Generalization of the Parallel Error Correcting Codes by Allowing Some Random Errors
This paper generalizes parallel error correcting codes proposed by Ahlswede et al. over a new type of multiple access channel called parallel error channel. The generalized parallel error correcting codes can handle with more errors compared with the original ones. We show construction methods of independent and non-independent parallel error correcting codes and decoding methods. We derive som...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 14 شماره
صفحات -
تاریخ انتشار 1998